combinatorial enumerationの例文

例文

1. Exponential generating functions are generally more convenient than ordinary generating functions for combinatorial enumeration problems that involve labelled objects.
2. Other applications of in combinatorics are connected with the use of the P髄ya enumeration theorem in combinatorial groups and combinatorial enumerations.
3. As well as being used to approximate the square root of two, Pell numbers can be used to find square triangular numbers, to construct integer approximations to the right isosceles triangle, and to solve certain combinatorial enumeration problems.